Deciding positivity of real polynomials
نویسندگان
چکیده
We describe an algorithm for deciding whether or not a real polynomial is positive semideenite. The question is reduced to deciding whether or not a certain zero-dimensional system of polynomial equations has a real root.
منابع مشابه
Universality of Polynomial Positivity and a Variant of Hilbert’s 17th Problem
We observe that the decision problem for the ∃ theory of real closed fields (RCF) is simply reducible to the decision problem for RCF over a connective-free ∀ language in which the only relation symbol is a strict inequality. In particular, every ∃ RCF sentence φ can be settled by deciding a proposition of the form “polynomial p (which is a sum of squares) takes on strictly positive values over...
متن کاملPositive Polynomials and Sums of Squares: Theory and Practice
If a real polynomial f can be written as a sum of squares of real polynomials, then clearly f is nonnegative on R, and an explicit expression of f as a sum of squares is a certificate of positivity for f . This idea, and generalizations of it, underlie a large body of theoretical and computational results concerning positive polynomials and sums of squares. In this survey article, we review the...
متن کاملReal roots of univariate polynomials and straight line programs
We give a new proof of the NP-hardness of deciding the existence of real roots of an integer univariate polynomial encoded by a straight line program based on certain properties of the Tchebychev polynomials. These techniques allow us to prove some new NP-hardness results related to real root approximation for polynomials given by straight line programs.
متن کاملPositive polynomials on fibre products
Recent investigations in optimization theory concerning the structure of positive polynomials with a sparsity pattern are interpreted in the more invariant language of (iterated) fibre products of real algebraic varieties. This opens the perspective of treating on a unifying basis the cases of positivity on unbounded supports, on non-semialgebraic supports, or of polynomials depending on counta...
متن کاملPOS3POLY—a MATLAB Preprocessor for Optimization with Positive Polynomials
Positive polynomials, relaxed to sum-of-squares in the multivariate case, are a very powerful instrument having applications in signal processing, control and other engineering fields. Hence, appeared the need of a library which can work with positive polynomials as variables in a convex optimization problem. We present here the POS3POLY library, which transforms polynomial positivity into posi...
متن کامل